Linked-cluster expansion for the graph-vertex coloration problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولLinked-Cluster Expansion of the Ising Model
The linked-cluster expansion technique for the high-temperature expansion of spin model is reviewed. A new algorithm for the computation of three-point and higher Green’s functions is presented. Series are computed for all components of two-point Green’s functions for a generalized 3D Ising model, to 25th order on the bcc lattice and to 23rd order on the sc lattice. Series for zero-momentum fou...
متن کاملNonequilibrium linked cluster expansion for steady-state quantum transport
We generalize the linked cluster expansion of Matsubara Green functions into nonequilibrium situations. This allows us to compute nonequilibrium correlation functions and, consequently, physical observables for interacting quantum systems with intermediate interaction strengths. As a specific example, we study nonlinear dc transport in a resonant tunneling system with electron-phonon interactio...
متن کاملThe robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملImproved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile
We prove two generalizations of the Cheeger’s inequality. The first generalization relates the second eigenvalue to the edge expansion and the vertex expansion of the graph G, λ2 = Ω(φ V (G) · φ(G)), where φ (G) denotes the robust vertex expansion of G and φ(G) denotes the edge expansion of G. The second generalization relates the second eigenvalue to the edge expansion and the expansion profil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1971
ISSN: 0095-8956
DOI: 10.1016/0095-8956(71)90046-3